Wavelet Projections for Radiosity
نویسندگان
چکیده
One important goal of image synthesis research is to accelerate the process of obtaining realistic images using the radiosity method. Two important concepts recently introduced are the general framework of projection methods and the hierarchical radiosity method. Wavelet theory, which explores the space of hierarchical basis functions, offers an elegant framework that unites these two concepts and allows us to more formally understand the hierarchical radiosity method. Wavelet expansions of the radiosity kernel have negligible entries in regions where high frequency/fine detail information is not needed. A sparse system remains if these entries are ignored. This is similar to applying a lossy compression scheme to the form factor matrix. The sparseness of the system allows for asymptotically faster radiosity algorithms by limiting the number of matrix terms that need to be computed. The application of these methods to 3D environments is described in [9]. Due to space limitations in that paper many of the subtleties of the construction could not be explored there. In this paper we discuss some of the mathematical details of wavelet projections and investigate the application of these methods to the radiosity kernel of a flatland environment, where many aspect are easier to visualize.
منابع مشابه
Wavelet Radiosity on Arbitrary Planar Surfaces
Wavelet radiosity is, by its nature, restricted to parallelograms or triangles. This paper presents an innovative technique enabling wavelet radiosity computations on planar surfaces of arbitrary shape, including concave contours or contours with holes. This technique replaces the need for triangulating such complicated shapes, greatly reducing the complexity of the wavelet radiosity algorithm ...
متن کاملSimulation Photoréaliste de l'éclairage en Synthèse d'Images
Wavelet radiosity is, by its nature, restricted to parallelograms or triangles. This paper presents an innovative technique enabling wavelet radiosity computations on planar surfaces of arbitrary shape, including concave contours or contours with holes. This technique replaces the need for triangulating such complicated shapes, greatly reducing the complexity of the wavelet radiosity algorithm ...
متن کاملA novel approach makes higher order wavelets really efficient for radiosity
Since wavelets were introduced in the radiosity algorithm5, surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previous study13 has shown that wavelet radiosity, and especially higher order wavelet radiosity was not bringing significant improvements over hierarchical radiosity and was having a very important extra memory cost, thus pr...
متن کاملSmart Links and Efficient Reconstruction for Wavelet Radiosity
Wavelet radiosity is the uniication of two important methods to solve the radiosity equation: hierarchical radiosity and Galerkin radiosity. Although wavelet radiosity can reap the beneets of both methods, there is still a lot of overhead and in practice several problems occur. For example, using Haar wavelets the traditional push-pull scheme leads to obviously wrong results near common patch b...
متن کاملWavelet Methods for Radiosity
The computation of radiosity ( W m ), i.e. power per unit area, on a given surface is a widely used technique in computer graphics to solve for the illumination in an environment. Radiosity is governed by an integral equation which arises from a more general integral equation known as the rendering equation [18] when one assumes that all reflection occurs isotropically. Solving the underlying i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 13 شماره
صفحات -
تاریخ انتشار 1994